翻訳と辞書 Words near each other ・ Threshold (door) ・ Threshold (Douglass novel) ・ Threshold (Morris novel) ・ Threshold (online game) ・ Threshold (Palmer novel) ・ Threshold (TV series) ・ Threshold Audio ・ Threshold braking ・ Threshold cryptosystem ・ Threshold displacement energy ・ Threshold Editions ・ Threshold effect ・ Threshold energy ・ Threshold Entertainment ・ Threshold expression ・ Threshold graph ・ Threshold host density ・ Threshold House ・ Threshold hypothesis ・ Threshold issues in Singapore administrative law ・ Threshold knowledge ・ Threshold limit value ・ Threshold model ・ Threshold Nunatak ・ Threshold of originality ・ Threshold of pain ・ Threshold pledge system ・ Threshold population ・ Threshold potential ・ Threshold price-point Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Threshold graph ： ウィキペディア英語版 Threshold graph In graph theory, a threshold graph is a graph that can be constructed from a one-vertex graph by repeated applications of the following two operations: #Addition of a single isolated vertex to the graph. #Addition of a single dominating vertex to the graph, i.e. a single vertex that is connected to all other vertices. For example, the graph of the figure is a threshold graph. It can be constructed by beginning with a single-vertex graph (vertex 1), and then adding black vertices as isolated vertices and red vertices as dominating vertices, in the order in which they are numbered. Threshold graphs were first introduced by . A chapter on threshold graphs appears in , and the book is devoted to them. == Alternative definitions == An equivalent definition is the following: a graph is a threshold graph if there are a real number $S$ and for each vertex $v$ a real vertex weight $w(v)$ such that for any two vertices $v,u$, $uv$ is an edge if and only if $w(u)+w(v)>\; S$. Another equivalent definition is this: a graph is a threshold graph if there are a real number $T$ and for each vertex $v$ a real vertex weight $a(v)$ such that for any vertex set $X\backslash subseteq\; V$, $X$ is independent if and only if $\backslash sum\_\; a(v)\; \backslash le\; T.$ The name "threshold graph" comes from these definitions: ''S'' is the "threshold" for the property of being an edge, or equivalently ''T'' is the threshold for being independent. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Threshold graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.